Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation
نویسندگان
چکیده
منابع مشابه
Reliability-based syndrome decoding of LDPC codes
Aiming at bridge gap between maximum likelihood decoding (MLD) and belief propagation (BP) decoding for short or medium LDPC codes, we present one modified ordered statistics decoding (OSD) reprocessing method, which is serially concatenated with standard BP. Meanwhile, two novel points in implementation are addressed. For one thing, the new definition of bit reliability proposed enhances error...
متن کاملDecoding Ldpc Codes over Binary Channels with Additive Markov Noise
We study the design of a belief propagation decoder for lowdensity parity check (LDPC) codes over binary channels with additive M th-order Markov noise, specifically the queuebased channel (QBC) [1]. The decoder is an extension of the sum product algorithm (SPA) for the case of memoryless channels and is similar to the one developed for the GilbertElliot channel [2, 3, 4]. Simulation results of...
متن کاملGeneralized reliability-based syndrome decoding for LDPC codes
Aiming at bridging the gap between the maximum likelihood decoding (MLD) and the suboptimal iterative decodings for short or medium length LDPC codes, we present a generalized ordered statistic decoding (OSD) in the form of syndrome decoding, to cascade with the belief propagation (BP) or enhanced min-sum decoding. The OSD is invoked only when the decoding failures are obtained for the preceded...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2013
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2012.2236604